Some results on self vertex switching
نویسندگان
چکیده
Let G(V, E) be a graph. A vertex v ∈ V(G) is said to be a self vertex switching of G, if G is isomorphic to G, where G is the graph obtained from G, by deleting all edges of G incident to v and adding edges between v and the vertices which are not adjacent to v in G. In this paper, we discuss some applications of self vertex switching and list out all trees and unicyclic graphs with unique self vertex switching. We also obtain some more results on self vertex switching.
منابع مشابه
Self Vertex Switching of Connected Bicyclic Graphs
-A vertex v V(G) is said to be a self vertex switching of G if G is isomorphic to G v , where G v is the graph obtained from G by deleting all edges of G incident to v and adding all edges incident to v which are not in G. In [5], trees and forests are characterized, each with a self vertex switching. In [6], connected unicyclic graphs, each with a self vertex switching are characterized. In th...
متن کاملSome results on vertex-edge Wiener polynomials and indices of graphs
The vertex-edge Wiener polynomials of a simple connected graph are defined based on the distances between vertices and edges of that graph. The first derivative of these polynomials at one are called the vertex-edge Wiener indices. In this paper, we express some basic properties of the first and second vertex-edge Wiener polynomials of simple connected graphs and compare the first and second ve...
متن کاملSome Results on Forgotten Topological Coindex
The forgotten topological coindex (also called Lanzhou index) is defined for a simple connected graph G as the sum of the terms du2+dv2 over all non-adjacent vertex pairs uv of G, where du denotes the degree of the vertex u in G. In this paper, we present some inequalit...
متن کاملOn hereditary clique-Helly self-clique graphs
A graph is clique-Helly if any family of mutually intersecting (maximal) cliques has non-empty intersection, and it is hereditary clique-Helly (abbreviated HCH) if its induced subgraphs are clique-Helly. The clique graph of a graph G is the intersection graph of its cliques, and G is self-clique if it is connected and isomorphic to its clique graph. We show that every HCH graph is an induced su...
متن کاملOn discriminativity of vertex-degree-based indices
A recently published paper [T. Došlić, this journal 3 (2012) 25-34] considers the Zagreb indices of benzenoid systems, and points out their low discriminativity. We show that analogous results hold for a variety of vertex-degree-based molecular structure descriptors that are being studied in contemporary mathematical chemistry. We also show that these results are straightforwardly obtained by u...
متن کامل